Neil Immerman - PDFSEARCH.IO - Document Search Engine

Neil Immerman
Results: 15

#	Item
11	Verification and Validation of Planning and Scheduling Systems (VVPS) Organizers: Saddek Bensalem, Klaus Havelund, Andrea Orlandini Date and Location: June 13, 2011, HallComputer Science Campus 09:00–1 Add to Reading List Source URL: icaps11.icaps-conference.org Language: English - Date: 2013-04-15 04:51:39 Bensalem Neil Immerman Workflow Workflow technology Azadeh Farzan
12	2010 Gödel Prize Call for Nominations The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2014-01-29 10:45:05 Gödel Prize ACM SIGACT International Colloquium on Automata Languages and Programming Mike Paterson Symposium on Theory of Computing Shafi Goldwasser Association for Computing Machinery Silvio Micali Neil Immerman Computer science Theoretical computer science Applied mathematics
13	What Can the GC Compute Efficiently? A Language for Heap Assertions at GC Time Christoph Reichenbach Neil Immerman Add to Reading List Source URL: www.eecs.tufts.edu Language: English - Date: 2010-08-13 16:15:27 Data types Memory management Tree traversal Garbage collection Object-oriented programming Assertion Function First-order logic Doubly linked list Mathematics Computing Software engineering
14	FIRST-ORDER AND TEMPORAL LOGICS FOR NESTED WORDS ´ KOUSHA ETESSAMI, RAJEEV ALUR, MARCELO ARENAS, PABLO BARCELO, NEIL IMMERMAN, AND LEONID LIBKIN Department of Computer and Information Science, University of Pennsylvania Add to Reading List Source URL: web.ing.puc.cl Language: English - Date: 2013-04-26 05:57:03 Nested word Words Temporal logic Nesting Stack Mathematical logic Model checking Scope FO Theoretical computer science Automata theory Software engineering
15	Book review of Descriptive Complexity by Neil Immerman (Graduate texts in Computer Science, Springer, [removed]Appeared in the Bulletin of Symbolic Logic vol. 7 no. 4 December, 2001 pages[removed]Overview Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:06 Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory Descriptive complexity theory Mathematical logic P versus NP problem FO P Theoretical computer science Applied mathematics Complexity classes

UPDATE